Game Theory Lecture Notes By
نویسنده
چکیده
Note: This is a only a draft version, so there could be flaws. If you find any errors, please do send email to [email protected]. A more thorough version would be available soon in this space. In this chapter, we introduce the all important notion of pure strategy Nash equilibrium. We provide several examples to illustrate this notion. We show that pure strategy Nash equilibrium may not exist in many cases while in many other cases, there could exist multiple Nash equilibria. We also show that the payoffs that players get in a Nash equilibrium may not be socially optimal. Dominant strategy equilibria (strongly dominant, weakly dominant, very weakly dominant), if they exist, are very desirable but rarely do they exist because the conditions to be satisfied are too demanding. A dominant strategy equilibrium requires that each player's choice be a best response against all possible choices of all the other players. If we only insist that each player's choice is a best response against the best response strategies of the other players, we get the notion of Nash equilibrium. This solution concept is named after John Nash, one of the most celebrated game theorists of our times. In this section, we introduce and discuss the notion of pure strategy Nash equilibrium. In the following section, we discuss the notion of mixed strategy Nash equilibrium. That is, each player's Nash equilibrium strategy is a best response to the Nash equilibrium strategies of the other players.
منابع مشابه
Lectures on Frugal Mechanism Design
These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...
متن کاملLecture Notes on Winning Strategies & Regions
This lecture continues the study of hybrid games and their logic, differential game logic [Pla15], that Lecture 20 on Hybrid Systems & Games started. Lecture 20 saw the introduction of differential game logic with a focus on identifying and highlighting the new dynamical aspect of adversarial dynamics. The meaning of hybrid games in differential game logic had been left informal, based on the i...
متن کاملAlgorithms for Computing Solution Concepts in Game Theory
These are notes for the first five lectures of the course on Algorithmic Game Theory, given (starting November 2008) in the Weizmann Institute jointly by Uriel Feige, Robert Krauthgamer and Moni Naor. The lecture notes are not intended to provide a comprehensive view of solution concepts in game theory, but rather discuss some of the algorithmic aspects involved. Hence some of the definitions w...
متن کاملLectures on Optimal Mechanism Design
These lecture notes cover the second third of the class CS364B, Topics in Algorithmic Game Theory, offered at Stanford University in the Fall 2005 term. They cover the topic of optimal mechanism design. As this is a traditional economic objective, we will review the Economics treatment of optimal mechanism design first before moving on to cover recent work on the problem from the theoretical co...
متن کاملFactors affecting students tendency of Univercity students to Lecture Notes
Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012